Dynamic Scheduling of Manufacturing Systems with Setups and Random Disruptions

نویسندگان

  • Fernando Tubilla
  • Stanley B. Gershwin
  • David E. Hardt
چکیده

Manufacturing systems are often composed of machines that can produce a variety of items but that most undergo time-consuming (and possibly costly) setups when switching between product types. Scheduling these setups efficiently can have important economic effects on the performance of the plant and involves a tradeoff between throughput, inventory, and operating costs. In addition, the schedule must be robust to random disruptions such as failures or raw material shortages, which are common in production environments. In this thesis, we study policies that address the setup scheduling problem dynamically, in response to current conditions in the system. A new heuristic, called the Hedging Zone Policy (HZP), is introduced and developed. It is a dynamic-sequence policy that always produces the current part type at its maximum production rate until a fixed base stock level is reached. Then, before switching setups, the policy might produce the current part type at its demand rate for some additional time. When selecting changeovers, the HZP implements two types of decision rules. If the difference between base stock and surplus level is small for all part types, the item with the largest weighted difference is selected. Otherwise, the policy uses a fixed priority ranking to select between items that are far from their base stock value. In order to demonstrate the benefits of our policy, we also adapt and implement several other heuristics that have been proposed in the literature for related models. The policies are first analyzed in a purely deterministic setting. The stability of the HZP is addressed and it is shown that a poor selection of its parameters leads to a condition in which some low-priority parts are ignored, resulting in an unstable system. Using Lyapunov’s direct method, we obtain an easy-to-evaluate and not-too-conservative condition that ensures production of all part types with bounded surplus. We then compare, through a series of extensive numerical experiments with three-part-type systems, the deterministic performance of the policies in both make-to-order and make-to-stock settings. We show that the HZP outperforms other policies within its class in both cases, a fact that is mainly attributed to its priority-based decisions. When compared to the approximate optimal cost of the problem, our policy performs very well in the make-to-order case, while the simplicity of its base stock structure makes it less competitive in the deterministic make-to-stock problem. The results are then leveraged for the study of a stochastic model, where we consider the effect of random disruptions in the form of machine failures. We prove that our model converges to a fluid limit under an appropriate scaling. This fact allows us to employ our deterministic stability conditions to verify the stochastic (rate) stability of the failure-prone system. We also extend our previous numerical experiments by characterizing the performance of the policies in the stochastic setting. The results show that the HZP still outperforms other policies in the same class. Furthermore, we find that except for cases where failures occur much less or much more frequently than changeovers, the HZP outperforms a fixed-sequence policy that is designed to track a pre-determined, near-optimal deterministic schedule. Thesis Supervisor: Stanley B. Gershwin Title: Senior Research Scientist, Mechanical Engineering

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimisation of assembly scheduling in VCIM systems using genetic algorithm

Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...

متن کامل

The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups

  The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...

متن کامل

Improving Manufacturing System Performance through Rescheduling

Many production facilities generate and update production schedules. Rescheduling is necessary because the manufacturing system is dynamic and unexpected events occur. This paper discusses rescheduling policies and how they affect the performance of manufacturing systems. The benefits of proper rescheduling include improved manufacturing system performance with reduced cost due to computational...

متن کامل

Dynamic setup scheduling and flow control in manufacturing systems

In this paper we propose a method for flow control of parts in a manufacturing system with machines that require setups. The setup scheduling problem is investigated in the context of a multilevel hierarchy of discrete events with distinct frequencies. The higher level of the hierarchy calculates a target trajectory in the surplus/backlog space of the part types which must be tracked at the lev...

متن کامل

Scheduling of flexible manufacturing systems using genetic algorithm: A heuristic approach

Scheduling of production in Flexible Manufacturing Systems (FMSs) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. The generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. Genetic algorithms are used in this paper to obtain an initial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011